package Day2025_03_12;

public class LeetCode309 {
    public int maxProfit(int[] p) {
        int n = p.length;
        int[][] dp = new int[n][3];
        dp[0][0] = -p[0]; dp[0][1] = 0; dp[0][2] = 0;
        for (int i = 1; i < n; i++) {
            dp[i][0] = Math.max(dp[i - 1][0], dp[i - 1][2] - p[i]);
            dp[i][1] = Math.max(dp[i - 1][0] + p[i], dp[i - 1][1]);
            dp[i][2] = dp[i - 1][1];
        }
        return Math.max(dp[n - 1][1], dp[n - 1][2]);
    }
}
